A general bulk service queue with arrival rate dependent on server breakdowns
نویسندگان
چکیده
منابع مشابه
Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates
This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...
متن کاملPH/PH/1 Bulk Arrival and Bulk Service Queue
This paper studies two stochastic bulk arrivals and bulk services PH/PH/1 queue Models (A) and (B) with k_(1 ) and k_2 as the number of phases of PH arrival and PH service distributions respectively. The system has infinite storing capacity and the arrival and service sizes are finite valued random variables. Matrix partitioning method is used to study the models. In Model (A) the maximum of th...
متن کاملA Heterogeneous Arrival Queue under N Policy with Server Breakdowns and Multiple Vacations
Abstract: The cumulative damage of highly reliable products that subject to multiple loading stresses is investigated under Wiener process. Optimal strategies on the constant-stress accelerated degradation test plan are established to reach a compromised decision between the experiment budget and the estimation precision on the reliability inference. An algorithm is provided to search an optima...
متن کاملA Heterogeneous Arrival Queue under N Policy with Server Breakdowns and Multiple Vacations
We consider the problem of investment and consumption with a hidden Markov model and a regime switching structure. The Bayesian approach is followed to integrate econometric consideration and to make inference of the hidden Markov model. The optimal investment strategy is characterized by the method of stochastic dynamic programming and simulation results are given.
متن کاملA General Input Queue with N Policy and Service Rate Depending on Bulk Size
An embedded Markov chain is used to analyze a G/M/1 queuing system with N policy. When the system is empty, the server remains idle (deactivates) and does not start serving the waiting customers in the queue until the number of arrivals reaches N. The service is performed in batches of min(n, N) if there are n customers waiting at the completion of service. Service times of the server depend o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1994
ISSN: 0307-904X
DOI: 10.1016/0307-904x(94)90258-5